Further development of multiple centrality correctors for interior point methods

نویسندگان

  • Marco Colombo
  • Jacek Gondzio
چکیده

This paper addresses the role of centrality in the implementation of interior point methods. We provide theoretical arguments to justify the use of a symmetric neighbourhood, and translate them into computational practice leading to a new insight into the role of recentering in the implementation of interior point methods. Second-order correctors, such as Mehrotra’s predictor–corrector, can occasionally fail: we derive a remedy to such difficulties from a new interpretation of multiple centrality correctors. Through extensive numerical experience we show that the proposed centrality correcting scheme leads to noteworthy savings over second-order predictor–corrector technique and previous implementations of multiple centrality correctors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regularized Symmetric Inde nite Systems in Interior Point Methods for Linear and Quadratic Optimization

This paper presents linear algebra techniques used in the implementation of an interior point method for solving linear programs and convex quadratic programs with linear constraints. New regularization techniques for Newton systems applicable to both symmetric positive de nite and symmetric inde nite systems are described. They transform the latter to quaside nite systems known to be strongly ...

متن کامل

An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...

متن کامل

Advances in interior point methods for large-scale linear programming

This research studies two computational techniques that improve the practical performance of existing implementations of interior point methods for linear programming. Both are based on the concept of symmetric neighbourhood as the driving tool for the analysis of the good performance of some practical algorithms. The symmetric neighbourhood adds explicit upper bounds on the complementarity pai...

متن کامل

A New Full-NT-Step Infeasible Interior-Point Algorithm for SDP Based on a Specific Kernel Function

In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasibl...

متن کامل

Optimal Design of Truss Structures with Frequency Constraints Using Interior Point Trust Region Method

Nowadays, in the industrial environment of simulation-based design, optimization has been widely applied. This article illustrates that how truss structural frequency optimization problems is being solved by interior point trust region method (IPTRM). As a possible way, primal-dual interior point method could optimize the structure by multiple centrality modifications with trust region subprobl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comp. Opt. and Appl.

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2008